It is widely believed that fractality of complex networks origins from hubrepulsion behaviors (anticorrelation or disassortativity), which means largedegree nodes tend to connect with small degree nodes. This hypothesis wasdemonstrated by a dynamical growth model, which evolves as the inverserenormalization procedure proposed by Song et al. Now we find that thedynamical growth model is based on the assumption that all the cross-boxeslinks has the same probability e to link to the most connected nodes insideeach box. Therefore, we modify the growth model by adopting the flexibleprobability e, which makes hubs have higher probability to connect with hubsthan non-hubs. With this model, we find some fractal and scale-free networkshave hub attraction behaviors (correlation or assortativity). The results arethe counter-examples of former beliefs.
展开▼
